#define atsum(l, r) accumulate(l, r, 0)
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3f;
template <typename T>
inline void chkmin(T &x, T y) {
    x = min(x, y);
}
template <typename T>
inline void chkmax(T &x, T y) {
    x = max(x, y);
}
namespace FastIO {
// ------------------------------
#define IN_HAS_NEG
#define OUT_HAS_NEG
#define CHK_EOF
#define DISABLE_MMAP
// ------------------------------
#if __cplusplus < 201400
#error Please use C++14 or higher.
#endif
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if (defined(LOCAL) || defined(_WIN32)) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include <sys/mman.h>
#endif
#ifdef LOCAL
inline char gc() { return getchar(); }
inline void pc(char c) { putchar(c); }
#else
#ifdef DISABLE_MMAP
INLINE_V constexpr int _READ_SIZE = 1 << 18;
INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr,
                                               *_read_ptr_end = nullptr;
inline char gc() {
    if (__builtin_expect(_read_ptr == _read_ptr_end, false)) {
        _read_ptr = _read_buffer;
        _read_ptr_end =
            _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin);
#ifdef CHK_EOF
        if (__builtin_expect(_read_ptr == _read_ptr_end, false)) return EOF;
#endif
    }
    return *_read_ptr++;
}
#else
INLINE_V static const char *_read_ptr =
    (const char *)mmap(nullptr, INT_MAX, 1, 2, 0, 0);
inline char gc() { return *_read_ptr++; }
#endif
INLINE_V constexpr int _WRITE_SIZE = 1 << 18;
INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer;
inline void pc(char c) {
    *_write_ptr++ = c;
    if (__builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false)) {
        fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
        _write_ptr = _write_buffer;
    }
}
INLINE_V struct _auto_flush {
    ~_auto_flush() {
        fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout);
    }
} _auto_flush;
#endif
#ifdef CHK_EOF
inline bool _isdigit(char c) { return (c & 16) && c != EOF; }
inline bool _isgraph(char c) { return c > 32 && c != EOF; }
#else
inline bool _isdigit(char c) { return c & 16; }
inline bool _isgraph(char c) { return c > 32; }
#endif
template <class T>
INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer;
template <class T>
INLINE_V constexpr bool _is_signed = numeric_limits<T>::is_signed;
template <class T>
INLINE_V constexpr bool _is_unsigned = _is_integer<T> && !_is_signed<T>;
template <>
INLINE_V constexpr bool _is_integer<__int128> = true;
template <>
INLINE_V constexpr bool _is_integer<__uint128_t> = true;
template <>
INLINE_V constexpr bool _is_signed<__int128> = true;
template <>
INLINE_V constexpr bool _is_unsigned<__uint128_t> = true;
#undef INLINE_V
inline void read(char &c) {
    do c = gc();
    while (!_isgraph(c));
}
inline void read_cstr(char *s) {
    char c = gc();
    while (!_isgraph(c)) c = gc();
    while (_isgraph(c)) *s++ = c, c = gc();
    *s = 0;
}
inline void read(string &s) {
    char c = gc();
    s.clear();
    while (!_isgraph(c)) c = gc();
    while (_isgraph(c)) s.push_back(c), c = gc();
}
#ifdef IN_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void read(T &x) {
    char c = gc();
    bool f = true;
    x = 0;
    while (!_isdigit(c)) {
        if (c == 45) f = false;
        c = gc();
    }
    if (f)
        while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
    else
        while (_isdigit(c)) x = x * 10 - (c & 15), c = gc();
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void read(T &x) {
    char c = gc();
    while (!_isdigit(c)) c = gc();
    x = 0;
    while (_isdigit(c)) x = x * 10 + (c & 15), c = gc();
}
inline void write(char c) { pc(c); }
inline void write_cstr(const char *s) {
    while (*s) pc(*s++);
}
inline void write(const string &s) {
    for (char c : s) pc(c);
}
#ifdef OUT_HAS_NEG
template <class T, enable_if_t<_is_signed<T>, int> = 0>
inline void write(T x) {
    char buffer[numeric_limits<T>::digits10 + 1];
    int digits = 0;
    if (x >= 0) do
            buffer[digits++] = (x % 10) | 48, x /= 10;
        while (x);
    else {
        pc(45);
        do buffer[digits++] = -(x % 10) | 48, x /= 10;
        while (x);
    }
    while (digits) pc(buffer[--digits]);
}
template <class T, enable_if_t<_is_unsigned<T>, int> = 0>
#else
template <class T, enable_if_t<_is_integer<T>, int> = 0>
#endif
inline void write(T x) {
    char buffer[numeric_limits<T>::digits10 + 1];
    int digits = 0;
    do buffer[digits++] = (x % 10) | 48, x /= 10;
    while (x);
    while (digits) pc(buffer[--digits]);
}
template <int N>
struct _tuple_io_helper {
    template <class... T>
    static inline void _read(tuple<T...> &x) {
        _tuple_io_helper<N - 1>::_read(x), read(get<N - 1>(x));
    }
    template <class... T>
    static inline void _write(const tuple<T...> &x) {
        _tuple_io_helper<N - 1>::_write(x), pc(32), write(get<N - 1>(x));
    }
};
template <>
struct _tuple_io_helper<1> {
    template <class... T>
    static inline void _read(tuple<T...> &x) {
        read(get<0>(x));
    }
    template <class... T>
    static inline void _write(const tuple<T...> &x) {
        write(get<0>(x));
    }
};
template <class... T>
inline void read(tuple<T...> &x) {
    _tuple_io_helper<sizeof...(T)>::_read(x);
}
template <class... T>
inline void write(const tuple<T...> &x) {
    _tuple_io_helper<sizeof...(T)>::_write(x);
}
template <class T1, class T2>
inline void read(pair<T1, T2> &x) {
    read(x.first), read(x.second);
}
template <class T1, class T2>
inline void write(const pair<T1, T2> &x) {
    write(x.first), pc(32), write(x.second);
}
template <class T1, class... T2>
inline void read(T1 &x, T2 &...y) {
    read(x), read(y...);
}
template <class... T>
inline void read_cstr(char *x, T *...y) {
    read_cstr(x), read_cstr(y...);
}
template <class T1, class... T2>
inline void write(const T1 &x, const T2 &...y) {
    write(x), write(y...);
}
template <class... T>
inline void write_cstr(const char *x, const T *...y) {
    write_cstr(x), write_cstr(y...);
}
template <class T>
inline void print(const T &x) {
    write(x);
}
inline void print_cstr(const char *x) { write_cstr(x); }
template <class T1, class... T2>
inline void print(const T1 &x, const T2 &...y) {
    print(x), pc(32), print(y...);
}
template <class... T>
inline void print_cstr(const char *x, const T *...y) {
    print_cstr(x), print_cstr(y...);
}
inline void println() { pc(10); }
inline void println_cstr() { pc(10); }
template <class... T>
inline void println(const T &...x) {
    print(x...), pc(10);
}
template <class... T>
inline void println_cstr(const T *...x) {
    print_cstr(x...), pc(10);
}
}  // namespace FastIO
using namespace FastIO;
template <typename T>
inline void clear(T &x) {
    T y;
    swap(x, y);
}
const int N = 1e3 + 10;
ll h[N];
ll dis[N], cc[N][N];
int n, m, pre[N], fl[N][N], pos[N], S, T, tk[N][N];
bool vis[N];
inline void adde(int u, int v, int f, ll c) {
    tk[u][v] = fl[u][v] = f, cc[u][v] = c, cc[v][u] = -c;
}
inline bool dij(int S, int T, int siz) {
    memset(dis, 0x3f, sizeof(dis[0]) * (siz + 2)), dis[S] = 0;
    memset(vis, 0, sizeof(vis[0]) * (siz + 2));
    for (int i = 0; i <= siz; i++) {
        int u = -1;
#pragma GCC unroll 8
        for (int j = 0; j <= siz; j++)
            if (!vis[j] && (u == -1 || dis[j] < dis[u])) u = j;
        if (u == -1) continue;
        vis[u] = 1;
        if (u == 1 || u == (n << 1 | 1)) {
            for (int j = 0; j <= siz; j++)
                if (fl[u][j] && dis[j] > dis[u] + cc[u][j] + h[u] - h[j])
                    dis[j] = dis[u] + cc[u][j] + h[u] - h[j], pre[j] = u;
        } else if (u >= 1 && u <= n) {
#pragma GCC unroll 8
            for (int j = n + 1; j <= n + n; j++)
                if (fl[u][j] && dis[j] > dis[u] + cc[u][j] + h[u] - h[j])
                    dis[j] = dis[u] + cc[u][j] + h[u] - h[j], pre[j] = u;
        } else {
#pragma GCC unroll 8
            for (int j = 1; j <= n; j++)
                if (fl[u][j] && dis[j] > dis[u] + cc[u][j] + h[u] - h[j])
                    dis[j] = dis[u] + cc[u][j] + h[u] - h[j], pre[j] = u;
            int j = n << 1 | 1;
            if (fl[u][j] && dis[j] > dis[u] + cc[u][j] + h[u] - h[j])
                dis[j] = dis[u] + cc[u][j] + h[u] - h[j], pre[j] = u;
        }
    }
    return dis[T] < (INF >> 1);
}
inline void predij(int S, int siz) {
    memset(h, 0x3f, sizeof(h[0]) * (siz + 2)), h[S] = 0;
    for (int u = 0; u <= siz; u++) {
        for (int v = 0; v <= siz; v++)
            if (fl[u][v] && h[v] > h[u] + cc[u][v])
                h[v] = h[u] + cc[u][v], pre[v] = u;
    }
}
ll qx[N];
inline pair<int, ll> SSP(int S, int T, int siz) {
    predij(S, siz);
    int mxf = 0;
    ll cost = 0;
    while (dij(S, T, siz)) {
        int minf = 0x3f3f3f3f;
#pragma GCC unroll 8
        for (int i = 0; i <= siz; i++) if (h[i] < (INF >> 1))h[i] += dis[i];
#pragma GCC unroll 8
        for (int i = T; i != S; i = pre[i]) chkmin(minf, fl[pre[i]][i]);
#pragma GCC unroll 8
        for (int i = T; i != S; i = pre[i]) {
            fl[i][pre[i]] += minf;
            fl[pre[i]][i] -= minf;
        }
        mxf += minf, cost += minf * h[T];
        qx[mxf] = cost;
    }
    // cerr << "find mxf:" << mxf << endl;
    return make_pair(mxf, cost);
}
ll disx[N][N];
int Q;
int main() {
    freopen("journey.in", "r", stdin);
    freopen("journey.out", "w", stdout);
    memset(disx, 0x3f, sizeof(disx));
    read(n, m, Q);
    for (int i = 1; i <= n; i++)
        adde(0, i, 1, 0), adde(i + n, n << 1 | 1, 1, 0);
    for (int i = 1; i <= m; i++) {
        int u, v;
        ll w;
        read(u, v, w), chkmin(disx[u][v], w);
    }
    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (i != j) chkmin(disx[i][j], disx[i][k] + disx[k][j]);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <=n; j++) if (disx[i][j] <= (INF >> 1)) adde(i, j + n, 1, disx[i][j]);
    int mxf = SSP(0, n << 1 | 1, n << 1 | 1).first;
    for (int i = 1; i <= Q; i++) {
        ll C;
        read(C);
        ll ans = INF;
        for (int j = 0; j <= mxf; j++) chkmin(ans, (n - j) * C + qx[j]);
        println(ans);
    }
    return 0;
}